关键词: 内容分发网络, 副本放置, 局部需求特征, 贪心算法

Abstract:

In order to improve customer satisfaction an optimal replica selection algorithm is proposed for content delivery network based on local request characteristic. In the case of limited storage capacity of surrogates, according to request characteristic of local surrogates, the local request characteristic is used as heuristic information to select replica. Simulations show that the proposed method can obtain higher request of coverage compared with several other algorithms.

Key words: content delivery networks, replica placement, local request characteristic, greedy algorithm